منابع مشابه
Negation-Limited Formulas
We give an efficient structural decomposition theorem for formulas that depends on their negation complexity and demonstrate its power with the following applications. We prove that every formula that contains t negation gates can be shrunk using a random restriction to a formula of size O(t) with the shrinkage exponent of monotone formulas. As a result, the shrinkage exponent of formulas that ...
متن کاملOn Valued Negation Normal Form Formulas
Subsets of the Negation Normal Form formulas (NNFs) of propositional logic have received much attention in AI and proved as valuable representation languages for Boolean functions. In this paper, we present a new framework, called VNNF, for the representation of a much more general class of functions than just Boolean ones. This framework supports a larger family of queries and transformations ...
متن کاملImproved Construction of Negation-limited Circuits
A theorem of Markov states that any system of boolean functions on n variables may be computed by a boolean circuit containing at most dlog2(n + 1)e negation gates. We call such a circuit negation-limited . A circuit with inputs x1; : : : ; xn and outputs :x1; : : : ;:xn is called an inverter . Fischer has constructed negation-limited inverters of size O(n2 log n) and depth O(log n). Recently, ...
متن کاملKnowledge Compilation: Decomposable Negation Normal Form versus Linkless Formulas
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...
متن کاملOn the Negation-Limited Circuit Complexity of Merging
A negation-limited circuit is a combinational circuit that consists of AND, OR gates and a limited number of NOT gates. In this paper, we investigate the complexity of negation-limited circuits. The (n; n) merging function is a function that merges two presorted binary sequences x 1 x n and y 1 y n into a sequence z 1 z 2n . We prove that the size complexity of the (n; n) merging function with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.11.027